From minimal embeddings to minimal diffusions

نویسندگان

  • Alexander M.G. Cox
  • Martin Klimmek
چکیده

We show that there is a one-to-one correspondence between diffusions and the solutions of the Skorokhod Embedding Problem due to Bertoin and Le-Jan. In particular, the minimal embedding corresponds to a ‘minimal local martingale diffusion’, which is a notion we introduce in this article. Minimality is closely related to the martingale property. A diffusion is minimal if it it minimises the expected local time at every point among all diffusions with a given distribution at an exponential time. Our approach makes explicit the connection between the boundary behaviour, the martingale property and the local-time characteristics of time-homogeneous diffusions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

More about Latin Tableaux and their Embeddings

It is shown that any non-solvable Latin Tableau (LT) has a solvable LT-extension with the same shape, and an algorithm computing the minimal such extension is presented. Minimal Latin Square embeddings of solvable Latin Tableaux are established. The results depend partly on the truth of the Wide Partition Conjecture for Latin Tableaux. More about Latin Tableaux and their Embeddings Bart Demoen ...

متن کامل

Minimal full polarized embeddings of dual polar spaces

Let be a thick dual polar space of rank n ≥ 2 admitting a full polarized embedding e in a finite-dimensional projective space , i.e., for every point x of , e maps the set of points of at non-maximal distance from x into a hyperplane e∗(x) of . Using a result of Kasikova and Shult [11], we are able the show that there exists up to isomorphisms a unique full polarized embedding of of minimal dim...

متن کامل

On the minimal nonzero distance between triangular embeddings of a complete graph

Given two triangular embeddings f and f ′ of a complete graph K and given a bijection φ : V (K) → V (K), denote by M(φ) the set of faces (x, y, z) of f such that (φ(x), φ(y), φ(z)) is not a face of f . The distance between f and f ′ is the minimal value of |M(φ)| as φ ranges over all bijections between the vertices of K. We consider the minimal nonzero distance between two triangular embeddings...

متن کامل

MINIMAL AND STATEWISE MINIMAL INTUITIONISTIC GENERAL L-FUZZY AUTOMATA

In this note, by considering the notions of the intuitionistic general L-fuzzy automaton and $(alpha, beta)$-language, we show that for any $(alpha, beta)$-language $mathcal{L}$, there exists a minimal intuitionistic general L-fuzzy automaton recognizing $mathcal{L}$.We prove that the minimal intuitionistic general L-fuzzy automaton is isomorphic with threshold $(alpha,beta)$ to any $(alpha, be...

متن کامل

On strongly almost trivial embeddings of graphs

An algorithm for detecting intrinsically knotted graphs, yielding many new minor minimal IK graphs. Ramin Naimi Occidental College We describe an algorithm that detects seemingly most (and possibly all) intrinsically knotted (IK) graphs, and can help find knotless embeddings for graphs that are not IK. We have used this algorithm, implemented as a Mathematica program, to find many new minor min...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013